A discrete convolution kernel for No-DC MRI
نویسندگان
چکیده
منابع مشابه
A discrete convolution kernel for No-DC MRI.
An analytical inversion formula for the exponential Radon transform with an imaginary attenuation coefficient was developed in 2007 (2007 Inverse Problems 23 1963-71). The inversion formula in that paper suggested that it is possible to obtain an exact MRI (magnetic resonance imaging) image without acquiring low-frequency data. However, this un-measured low-frequency region (ULFR) in the k-spac...
متن کاملA Discrete Singular Convolution Method for the Seepage Analysis in Porous Media with Irregular Geometry
A novel discrete singular convolution (DSC) formulation is presented for the seepage analysis in irregular geometric porous media. The DSC is a new promising numerical approach which has been recently applied to solve several engineering problems. For a medium with regular geometry, realizing of the DSC for the seepage analysis is straight forward. But DSC implementation for a medium with ir...
متن کاملA Ontology Kernel - A Convolution Kernel for Ontology Alignment
Every ontology entity such as a concept or a property has its own structural information represented as a graph due to the relations with other entities. Therefore, it is important to consider not only its lexical similarity but also structural similarity in ontology alignment. This paper proposes ontology kernel that computes both types of similarities simultaneously. The idea of this kernel i...
متن کاملOntology Kernel A Convolution Kernel for Ontology Alignment
Every ontology entity such as a concept or a property has its own structural information represented as a graph due to the relations with other entities. Therefore, it is important to consider not only its lexical similarity but also structural similarity in ontology alignment. This paper proposes ontology kernel that computes both types of similarities simultaneously. The idea of this kernel i...
متن کاملDescending-Path Convolution Kernel for Syntactic Structures
Convolution tree kernels are an efficient and effective method for comparing syntactic structures in NLP methods. However, current kernel methods such as subset tree kernel and partial tree kernel understate the similarity of very similar tree structures. Although soft-matching approaches can improve the similarity scores, they are corpusdependent and match relaxations may be task-specific. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2015
ISSN: 0266-5611,1361-6420
DOI: 10.1088/0266-5611/31/8/085006